43 research outputs found

    Timing and resource-aware mapping of quantum circuits to superconducting processors

    Get PDF
    Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency, decreasing the algorithm's success rate. It is crucial to minimize mapping overhead, especially for Noisy Intermediate-Scale Quantum (NISQ) processors that have relatively short qubit coherence times and high gate error rates. Most of prior mapping algorithms have only considered constraints such as the primitive gate set and qubit connectivity, but the actual gate duration and the restrictions imposed by the use of shared classical control electronics have not been taken into account. In this paper, we present a timing and resource-aware mapper called Qmap to make quantum circuits executable on a scalable superconducting processor named Surface-17 with the objective of achieving the shortest circuit latency. In particular, we propose an approach to formulate the classical control restrictions as resource constraints in a conventional list scheduler with polynomial complexity. Furthermore, we implement a routing heuristic to cope with the connectivity limitation. This router finds a set of movement operations that minimally extends circuit latency. To analyze the mapping overhead and evaluate the performance of different mappers, we map 56 quantum benchmarks onto Surface-17. Compared to a prior mapping strategy that minimizes the number of operations, Qmap can reduce the latency overhead up to 47.3% and operation overhead up to 28.6%, respectively.Comment: Include details on the resource-constrained scheduling algorithm. Comments are most welcom

    Mapping quantum algorithms to multi-core quantum computing architectures

    Full text link
    Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which different quantum processors (cores) are connected via quantum and classical links. This new architectural design poses new challenges such as the expensive inter-core communication. To reduce these movements when executing a quantum algorithm, an efficient mapping technique is required. In this paper, a detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. In addition, we further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem, by performing an architectural scalability analysis

    Characterizing the spatio-temporal qubit traffic of a quantum intranet aiming at modular quantum computer architectures

    Get PDF
    Quantum many-core processors are envisioned as the ultimate solution for the scalability of quantum computers. Based upon Noisy Intermediate-Scale Quantum (NISQ) chips interconnected in a sort of quantum intranet, they enable large algorithms to be executed on current and close future technology. In order to optimize such architectures, it is crucial to develop tools that allow specific design space explorations. To this aim, in this paper we present a technique to perform a spatio-temporal characterization of quantum circuits running in multi-chip quantum computers. Specifically, we focus on the analysis of the qubit traffic resulting from operations that involve qubits residing in different cores, and hence quantum communication across chips, while also giving importance to the amount of intra-core operations that occur in between those communications. Using specific multi-core performance metrics and a complete set of benchmarks, our analysis showcases the opportunities that the proposed approach may provide to guide the design of multi-core quantum computers and their interconnects.Peer ReviewedPostprint (author's final draft

    Integrative modeling of transcriptional regulation in response to antirheumatic therapy

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>The investigation of gene regulatory networks is an important issue in molecular systems biology and significant progress has been made by combining different types of biological data. The purpose of this study was to characterize the transcriptional program induced by etanercept therapy in patients with rheumatoid arthritis (RA). Etanercept is known to reduce disease symptoms and progression in RA, but the underlying molecular mechanisms have not been fully elucidated.</p> <p>Results</p> <p>Using a DNA microarray dataset providing genome-wide expression profiles of 19 RA patients within the first week of therapy we identified significant transcriptional changes in 83 genes. Most of these genes are known to control the human body's immune response. A novel algorithm called TILAR was then applied to construct a linear network model of the genes' regulatory interactions. The inference method derives a model from the data based on the Least Angle Regression while incorporating DNA-binding site information. As a result we obtained a scale-free network that exhibits a self-regulating and highly parallel architecture, and reflects the pleiotropic immunological role of the therapeutic target TNF-alpha. Moreover, we could show that our integrative modeling strategy performs much better than algorithms using gene expression data alone.</p> <p>Conclusion</p> <p>We present TILAR, a method to deduce gene regulatory interactions from gene expression data by integrating information on transcription factor binding sites. The inferred network uncovers gene regulatory effects in response to etanercept and thus provides useful hypotheses about the drug's mechanisms of action.</p

    ENIGMA and global neuroscience: A decade of large-scale studies of the brain in health and disease across more than 40 countries

    Get PDF
    This review summarizes the last decade of work by the ENIGMA (Enhancing NeuroImaging Genetics through Meta Analysis) Consortium, a global alliance of over 1400 scientists across 43 countries, studying the human brain in health and disease. Building on large-scale genetic studies that discovered the first robustly replicated genetic loci associated with brain metrics, ENIGMA has diversified into over 50 working groups (WGs), pooling worldwide data and expertise to answer fundamental questions in neuroscience, psychiatry, neurology, and genetics. Most ENIGMA WGs focus on specific psychiatric and neurological conditions, other WGs study normal variation due to sex and gender differences, or development and aging; still other WGs develop methodological pipelines and tools to facilitate harmonized analyses of "big data" (i.e., genetic and epigenetic data, multimodal MRI, and electroencephalography data). These international efforts have yielded the largest neuroimaging studies to date in schizophrenia, bipolar disorder, major depressive disorder, post-traumatic stress disorder, substance use disorders, obsessive-compulsive disorder, attention-deficit/hyperactivity disorder, autism spectrum disorders, epilepsy, and 22q11.2 deletion syndrome. More recent ENIGMA WGs have formed to study anxiety disorders, suicidal thoughts and behavior, sleep and insomnia, eating disorders, irritability, brain injury, antisocial personality and conduct disorder, and dissociative identity disorder. Here, we summarize the first decade of ENIGMA's activities and ongoing projects, and describe the successes and challenges encountered along the way. We highlight the advantages of collaborative large-scale coordinated data analyses for testing reproducibility and robustness of findings, offering the opportunity to identify brain systems involved in clinical syndromes across diverse samples and associated genetic, environmental, demographic, cognitive, and psychosocial factors

    Mechanisms of prey size selecon in a suspension feeding copepod, Temora longicornis

    Get PDF
    We examined size-dependent prey detection and prey capture in free-swimming Temora longicornis using video observations, particle image velocimetry (PIV), and bottle incubations with phytoplankton prey sizes within the range 6-60 µm equivalent spherical diameter (ESD). T. longicornis generates feeding currents by oscillating its appendages at about 25 Hz. Prey cells >10 µm ESD are perceived and captured individually. A capture response was elicited when prey was touched by (or within a few cell radii from) the setae on the feeding appendages. The extension of the setae defines the prey encounter cross section, which is therefore independent of prey size. The flux of water through the encounter area, estimated from PIV, was ca. 150 ml ind.-1 d-1, which represents the maximum possible clearance rates and was similar to that estimated in incubation experiments. However, while the detection probability was nearly 100% for cells >10-15 µm, it declined rapidly for smaller cells. Conversely, the probability that a cell which elicited a capture response was actually ingested declined with increased cell size, from nearly 100% for small cells, to ~0% for the largest cells examined. The resulting prey size spectrum, predicted as the product of the cell-size-specific encounter rates and capture probabilities, was dome-shaped, with a maximum around 20-30 µm ESD. The prey size spectrum from incubation experiments had a similar shape and an optimum range of 30-50 µm ESD. The mechanistic underpinning of the prey size spectrum suggested here deviates from previous descriptions mainly in the mechanism and range of prey detection.Fil: Gonçalves, Rodrigo Javier. Technical University of Denmark; Dinamarca. Fundación Playa Unión. Estación de Fotobiología Playa Unión; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: van Someren Gréve, Hans. Technical University of Denmark; DinamarcaFil: Couespel, Damien. Technical University of Denmark; DinamarcaFil: Kiørboe, Thomas. Technical University of Denmark; Dinamarc
    corecore